Tootfinder

We Know I Know You Know; Choreographic Programming With Multicast and Multiply Located Values
Mako Bates, Joe Near
https://arxiv.org/abs/2403.05417 https:/…

We Know I Know You Know; Choreographic Programming With Multicast and Multiply Located Values
Concurrent distributed systems are notoriously difficult to construct and reason about. Choreographic programming is a recent paradigm that describes a distributed system in a single global program called a choreography. Choreographies simplify reasoning about distributed systems and can ensure deadlock freedom by static analysis. In previous choreographic programming languages, each value is located at a single party, and the programmer is expected to insert special untyped "select" operations…

Strong Priority and Determinacy in Timed CCS
Luigi Liquori, Michael Mendler
https://arxiv.org/abs/2403.04618 https://arxiv.org/pdf/24…

Strong Priority and Determinacy in Timed CCS
Building on the classical theory of process algebra with priorities, we identify a new scheduling mechanism, called "sequentially constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinism-by-construction for multi-cast concurrent communication. In particular, it permits us to model shared memory multi-threading with reaction to absence as it lies at the core of the programming langu…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
Xinzijian Liu, Yanbo Han, Zhuoyuan Li, Jiahao Fan, Chengqian Zhang, Jinzhe Zeng, Yifan Shan, Yannan Yuan, Wei-Hong Xu, Yun-Pei Liu, Yuzhi Zhang, Tongqi Wen, Darrin M. York, Zhicheng Zhong, Hang Zheng, Jun Cheng, Linfeng Zhang, Han Wang
https://arxiv…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
In the AI-for-science era, scientific computing scenarios such as concurrent learning and high-throughput computing demand a new generation of infrastructure that supports scalable computing resources and automated workflow management on both cloud and high-performance supercomputers. Here we introduce Dflow, an open-source Python toolkit designed for scientists to construct workflows with simple programming interfaces. It enables complex process control and task scheduling across a distributed…

When your concurrent programming isn't quite right

/via https://instagr.am/p/C554TxyIcpj/ #ifttt #automated

This https://arxiv.org/abs/2403.04618 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Strong Priority and Determinacy in Timed CCS
Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinacy-by-construction for multi-cast concurrent communication with shared memory. In the technical setting of CCS extended by clocks and priorities, we prove for a large class of "coherent" processes a confluence prop…

When your concurrent programming isn't quite right

/via https://instagr.am/p/C554TxyIcpj/ #ifttt #automated

This https://arxiv.org/abs/2403.04618 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Strong Priority and Determinacy in Timed CCS
Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinacy-by-construction for multi-cast concurrent communication with shared memory. In the technical setting of CCS extended by clocks and priorities, we prove for a large class of "coherent" processes a confluence prop…

This https://arxiv.org/abs/2403.04618 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Strong Priority and Determinacy in Timed CCS
Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinacy-by-construction for multi-cast concurrent communication with shared memory. In the technical setting of CCS extended by clocks and priorities, we prove for a large class of "coherent" processes a confluence prop…

This https://arxiv.org/abs/2403.05417 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

We Know I Know You Know; Choreographic Programming With Multicast and Multiply Located Values
Concurrent distributed systems are notoriously difficult to construct and reason about. Choreographic programming is a recent paradigm that describes a distributed system in a single global program called a choreography. Choreographies simplify reasoning about distributed systems and can ensure deadlock freedom by static analysis. In previous choreographic programming languages, each value is located at a single party, and the programmer is expected to insert special untyped "select" operations…